A Link-click-concept based Ranking Algorithm for Ranking Search Results
نویسندگان
چکیده
منابع مشابه
A New Ranking Technique for Ranking Phase of Search Engine: Size based Ranking Algorithm (SBRA)
The objective of this paper is to propose a new ranking technique or method for the web page rank. Different search engines use the different algorithm for the ranking of the web pages. Web Page ranking algorithm works only on the web page repository or indexed pages to the search engine for ranking. In reality, search engines works in two phases one is crawling phase and another is ranking pha...
متن کاملDWRank: Learning concept ranking for ontology search
With the recent growth of Linked Data on the Web there is an increased need for knowledge engineers to find ontologies to describe their data. Only limited work exists that addresses the problem of searching and ranking ontologies based on a given query term. In this paper we introduce DWRank, a two-staged bi-directional graph walk ranking algorithm for concepts in ontologies. DWRank characteri...
متن کاملRelational link-based ranking
Link analysis methods show that the interconnections between web pages have lots of valuable information. The link analysis methods are, however, inherently oriented towards analyzing binary relations. We consider the question of generalizing link analysis methods for analyzing relational databases. To this aim, we provide a generalized ranking framework and address its practical implications. ...
متن کاملA Link-Based Ranking Model for Services
The number of services on the web is growing every day and finding useful and efficient ranking methods for services has become an important issue in modern web applications. In this paper we present a link-based importance model and efficient algorithms for distributed services collaborating through service calls. We adapt the PageRank algorithm and define a service importance that reflects it...
متن کاملSession Based Click Features for Recency Ranking
Recency ranking refers to the ranking of web results by accounting for both relevance and freshness. This is particularly important for “recency sensitive” queries such as breaking news queries. In this study, we propose a set of novel click features to improve machine learned recency ranking. Rather than computing simple aggregate click through rates, we derive these features using the tempora...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indian Journal of Science and Technology
سال: 2014
ISSN: 0974-6846,0974-5645
DOI: 10.17485/ijst/2014/v7i10.32